termination problem - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

termination problem - перевод на русский

1940'S – 1960'S U.S. ASSIMILATION POLICY TOWARDS NATIVE AMERICANS
California Rancheria Act of 1958; Termination Act; Termination Acts; Indian Termination Act; Termination policy; California Rancheria Termination Act; Indian Termination Policy; Indian termination
  • [[Ada Deer]] was not in favor of termination.
  • Republican Senator [[Arthur Watkins]] of Utah was the chief Congressional proponent of Indian termination
  • Secretary of the Interior]], 1953–1956
  • self-determination]] instead of termination.
Найдено результатов: 972
termination problem      

математика

задача о завершении работы

knapsack problem         
  • multiple constrained problem]] could consider both the weight and volume of the boxes. <br />(Solution: if any number of each box is available, then three yellow boxes and three grey boxes; if only the shown boxes are available, then all except for the green box.)
  • A demonstration of the dynamic programming approach.
PROBLEM IN COMBINATORIAL OPTIMIZATION
0/1 knapsack problem; 0-1 knapsack problem; Unbounded knapsack problem; Unbounded Knapsack Problem; Binary knapsack problem; Napsack problem; Backpack problem; 0-1 Knapsack problem; Integer knapsack problem; Knapsack Problem; Algorithms for solving knapsack problems; Methods for solving knapsack problems; Approximation algorithms for the knapsack problem; Bounded knapsack problem; Multiple knapsack problem; Rucksack problem; Computational complexity of the knapsack problem

математика

задача о ранце

knapsack problem         
  • multiple constrained problem]] could consider both the weight and volume of the boxes. <br />(Solution: if any number of each box is available, then three yellow boxes and three grey boxes; if only the shown boxes are available, then all except for the green box.)
  • A demonstration of the dynamic programming approach.
PROBLEM IN COMBINATORIAL OPTIMIZATION
0/1 knapsack problem; 0-1 knapsack problem; Unbounded knapsack problem; Unbounded Knapsack Problem; Binary knapsack problem; Napsack problem; Backpack problem; 0-1 Knapsack problem; Integer knapsack problem; Knapsack Problem; Algorithms for solving knapsack problems; Methods for solving knapsack problems; Approximation algorithms for the knapsack problem; Bounded knapsack problem; Multiple knapsack problem; Rucksack problem; Computational complexity of the knapsack problem
задача об укладке ранца (рюкзака)
termination         
WIKIMEDIA DISAMBIGUATION PAGE
Termination (disambiguation); Terminations
termination noun 1) конец; окончание, истечение срока, предел 2) gram. окончание 3) исход, результат
assignment problem         
COMBINATORIAL OPTIMIZATION PROBLEM
Linear assignment problem; Unbalanced assignment problem; Credit assignment problem
1) задача о назначениях
2) задача о распределении (напр. ресурсов)
assignment problem         
COMBINATORIAL OPTIMIZATION PROBLEM
Linear assignment problem; Unbalanced assignment problem; Credit assignment problem

математика

задача о назначениях

traveling salesman problem         
  • 1) An ant chooses a path among all possible paths and lays a pheromone trail on it. 2) All the ants are travelling on different paths, laying a trail of pheromones proportional to the quality of the solution. 3) Each edge of the best path is more reinforced than others. 4) Evaporation ensures that the bad solutions disappear. The map is a work of Yves Aubry [http://openclipart.org/clipart//geography/carte_de_france_01.svg].
  • Ant colony optimization algorithm for a TSP with 7 cities: Red and thick lines in the pheromone map indicate presence of more pheromone
  • Solution of a TSP with 7 cities using a simple Branch and bound algorithm. Note: The number of permutations is much less than Brute force search
  • Solution to a symmetric TSP with 7 cities using brute force search. Note: Number of permutations: (7&minus;1)!/2 = 360
  • Creating a matching
  • Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed
  • An example of a 2-opt iteration
  • Using a shortcut heuristic on the graph created by the matching above
  • Symmetric TSP with four cities
  • William Rowan Hamilton
NP-HARD PROBLEM IN COMBINATORIAL OPTIMIZATION
Traveling salesperson problem; Traveling Salesman Problem; Euclidean traveling salesman problem; Euclidean TSP; Wandering salesman problem; Traveling salesman problem; Euclidian TSP; Travelling salesperson problem; Salesman problem; Tsp problem; TSP Problem; Travelling Salesman Problem; Travelling Salesman problem; Traveling Salesman problem; Travelling-salesman problem; Euclidean traveling salesman; Metric traveling salesman; Euclidean travelling salesman; Generalized travelling salesman problem; Generalized traveling salesman problem; Traveling tourist problem; Delta travelling salesman problem; Metric tsp; Willy Loman problem; Salesperson Problem; Travelling salesmen problem; Metric TSP; Traveling salesmen problem; Euclidean travelling salesman problem; Traveling salesman puzzle; Salesman Problem; TSP problem; Approximation algorithms for the traveling salesman problem; Computational complexity of the travelling salesman problem
задача коммивояжёра
travelling salesman problem         
  • 1) An ant chooses a path among all possible paths and lays a pheromone trail on it. 2) All the ants are travelling on different paths, laying a trail of pheromones proportional to the quality of the solution. 3) Each edge of the best path is more reinforced than others. 4) Evaporation ensures that the bad solutions disappear. The map is a work of Yves Aubry [http://openclipart.org/clipart//geography/carte_de_france_01.svg].
  • Ant colony optimization algorithm for a TSP with 7 cities: Red and thick lines in the pheromone map indicate presence of more pheromone
  • Solution of a TSP with 7 cities using a simple Branch and bound algorithm. Note: The number of permutations is much less than Brute force search
  • Solution to a symmetric TSP with 7 cities using brute force search. Note: Number of permutations: (7&minus;1)!/2 = 360
  • Creating a matching
  • Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed
  • An example of a 2-opt iteration
  • Using a shortcut heuristic on the graph created by the matching above
  • Symmetric TSP with four cities
  • William Rowan Hamilton
NP-HARD PROBLEM IN COMBINATORIAL OPTIMIZATION
Traveling salesperson problem; Traveling Salesman Problem; Euclidean traveling salesman problem; Euclidean TSP; Wandering salesman problem; Traveling salesman problem; Euclidian TSP; Travelling salesperson problem; Salesman problem; Tsp problem; TSP Problem; Travelling Salesman Problem; Travelling Salesman problem; Traveling Salesman problem; Travelling-salesman problem; Euclidean traveling salesman; Metric traveling salesman; Euclidean travelling salesman; Generalized travelling salesman problem; Generalized traveling salesman problem; Traveling tourist problem; Delta travelling salesman problem; Metric tsp; Willy Loman problem; Salesperson Problem; Travelling salesmen problem; Metric TSP; Traveling salesmen problem; Euclidean travelling salesman problem; Traveling salesman puzzle; Salesman Problem; TSP problem; Approximation algorithms for the traveling salesman problem; Computational complexity of the travelling salesman problem
задача коммивояжера
termination         
WIKIMEDIA DISAMBIGUATION PAGE
Termination (disambiguation); Terminations
конец, окончание; истечение срока; прекращение; прекращение действия; прекращение использования
- contract termination
- service termination
secretary problem         
  • Learning in the partial-information sequential search paradigm. The numbers display the expected values of applicants based on their relative rank (out of m total applicants seen so far) at various points in the search. Expectations are calculated based on the case when their values are uniformly distributed between 0 and 1. Relative rank information allows the interviewer to more finely evaluate applicants as they accumulate more data points to compare them to.
MATHEMATICAL PROBLEM
Sultan's Dowry Problem; Sultan's dowry problem; Secretary problems; 37% rule; 37% Rule

математика

задача о секретаре

задача о выборе наилучшего объекта

Определение

0/1 knapsack problem
<application> The knapsack problem restricted so that the number of each item is zero or one. (1995-03-13)

Википедия

Indian termination policy

Indian termination is a phrase describing United States policies relating to Native Americans from the mid-1940s to the mid-1960s. It was shaped by a series of laws and practices with the intent of assimilating Native Americans into mainstream American society. Cultural assimilation of Native Americans was not new; the belief that indigenous people should abandon their traditional lives and become what the government considers "civilized" had been the basis of policy for centuries. What was new, however, was the sense of urgency that, with or without consent, tribes must be terminated and begin to live "as Americans." To that end, Congress set about ending the special relationship between tribes and the federal government.

In practical terms, the policy ended the federal government's recognition of sovereignty of tribes, trusteeship over Indian reservations, and the exclusion of state law's applicability to Native persons. From the government's perspective, Native Americans were to become taxpaying citizens subject to state and federal taxes as well as laws from which they had previously been exempt.

From the Native standpoint, a former US Senator from Colorado Ben Nighthorse Campbell, of the Northern Cheyenne, said of assimilation and termination in a speech delivered in Montana:

If you can't change them, absorb them until they simply disappear into the mainstream culture.... In Washington's infinite wisdom, it was decided that tribes should no longer be tribes, never mind that they had been tribes for thousands of years.

The policy for termination of tribes collided with the Native American peoples' own desires to preserve Native identity. The termination policy was changed in the 1960s and rising activism resulted in the ensuing decades of restoration of tribal governments and increased Native American self-determination.

Как переводится termination problem на Русский язык